Eigenvector Crossover in the Efficient jSO Algorithm
نویسندگان
چکیده
منابع مشابه
Efficient coordinate-wise leading eigenvector computation
We develop and analyze efficient ”coordinatewise” methods for finding the leading eigenvector, where each step involves only a vector-vector product. We establish global convergence with overall runtime guarantees that are at least as good as Lanczos’s method and dominate it for slowly decaying spectrum. Our methods are based on combining a shift-and-invert approach with coordinate-wise algorit...
متن کاملEigenvector algorithm for blind MA system identification
We present a novel approach to the blind estimation of a linear time-invariant possibly mixed-phase moving average (MA) system (channel) based on second and fourth order statistics of the stationary received signal. As the algorithm incorporates the solution of an eigenvector problem, it is termed EVI standing for EigenVector approach to blind Identification. One of EVI's main features is its a...
متن کاملGeneralized eigenvector algorithm for blind equalization
In 1994, an eigenvector solution to the problem of blind equalization of possibly mixed-phase linear time-invariant transmission channels was published in this journal. Unfortunately, this solution is ambiguous on a certain condition. In this paper, we introduce a novel iterative method termed EigenVector Algorithm for blind equalization (EVA), which not only overcomes the uniqueness problem, b...
متن کاملAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MENDEL
سال: 2019
ISSN: 2571-3701,1803-3814
DOI: 10.13164/mendel.2019.1.065